The MIN PFS problem and piecewise linear model estimation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The MIN PFS problem and piecewise linear model estimation

We consider a new combinatorial optimization problem related to linear systems (MIN PFS) that consists, given an infeasible system, in finding a partition into a minimum number of feasible subsystems. MIN PFS allows formalization of the fundamental problem of piecewise linear model estimation, which is an attractive alternative when modeling a wide range of nonlinear phenomena. Since MIN PFS tu...

متن کامل

Max-Min Representation of Piecewise Linear Functions

It is shown that a piecewise linear function on a convex domain in R can be represented as a boolean polynomial in terms of its linear components.

متن کامل

Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem

Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...

متن کامل

Min-max piecewise constant optimal control for multi-model linear systems

The present work addresses a finite-horizon linear-quadratic optimal control problem for uncertain systems driven by piecewise constant controls. The precise values of the system parameters are unknown, but assumed to belong to a finite set (i.e., there exist only finitely many possible models for the plant). Uncertainty is dealt with using a min-max approach (i.e., we seek the best control for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2002

ISSN: 0166-218X

DOI: 10.1016/s0166-218x(01)00260-8